منابع مشابه
an investigation on influencing factors on tourists shopping attitude of iranian handmade carpet in isfahan
چکیده ندارد.
15 صفحه اولAnti-forcing number of some specific graphs
Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...
متن کاملOn Factors in Random Graphs
The following result is proved: Let G,.p be a random graph with n vertices and probability p for an edge. If p is such that the random graph has min-degree at least r with probability l, then any f-factor I _-< f _r exists with probability 1, as yl ----) r 1. Definitions and results Let G be a graph with vertex set V(G), edge set E ( G ) . Given a map f of V ( G ) into the set of non-negative i...
متن کاملOn even [2, b]-factors in graphs
For each even integer b ≥ 2 we prove that a graph G with n vertices has an even [2, b]-factor if G is 2-edge connected and each vertex of G has degree at least max{3, 2n b+2 }.
متن کاملOn f-factors in claw-free graphs
Let G be a 2-connected claw-free graph such that δ(G) ≥ 5. Then for every function f : V (G) → {1, 2}, where x∈V (G) f(x) is even, G has an f -factor. All graphs considered are assumed to be simple and finite. We refer the reader to [1] for standard graph theoretic terms not defined in this paper. Let G be a graph. The degree dG(u) of a vertex u in G is the number of edges of G incident with u....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Graphs and Combinatorics
سال: 2020
ISSN: 0911-0119,1435-5914
DOI: 10.1007/s00373-020-02225-1